Strictly Positive and Continuous Random Fibonacci Sequences and Network Theory Applications

نویسندگان

  • David E. Simmons
  • Justin P. Coon
چکیده

We motivate the study of a certain class of random Fibonacci sequences which we call continuous random Fibonacci sequences by demonstrating that their exponential growth rate can be used to establish capacity and power scaling laws for multihop cooperative amplify-and-forward (AF) relay networks. With these laws, we show that it is possible to construct multihop cooperative AF networks that simultaneously avoid 1) exponential capacity decay and 2) exponential transmit power growth across the network. This is achieved by ensuring the network’s Lyapunov exponent is zero.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-Abelian Sequenceable Groups Involving ?-Covers

A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...

متن کامل

A Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks

The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...

متن کامل

Toeplitz transforms of Fibonacci sequences

We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.

متن کامل

The Asymptotic Growth Rate of Random Fibonacci Type Sequences Ii

In this paper, we use ergodic theory to compute the aysmptotic growth rate of a family of random Fibonacci type sequences. This extends the result in [2]. We also prove some Lochs-type results regarding the effectiveness of various number theoretic expansions.

متن کامل

The Asymptotic Growth Rate of Random Fibonacci Type Sequences

Estimating the growth rate of random Fibonacci-type sequences is both challenging and fascinating. In this paper, by using ergodic theory, we prove a new result in this area. Let a denote an infinite sequence of natural numbers {a1, a2, · · · } and define a random Fibonaccitype sequence by f−1 = 0, f0 = 1, a0 = 0, and fk = 2fk−1 + 2fk−2 for k ≥ 1. Then, for almost all such infinite sequences a,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1602.07225  شماره 

صفحات  -

تاریخ انتشار 2016